Getting Topological Information for a 80-Adjacency Doxel-Based 4D Volume through a Polytopal Cell Complex
نویسندگان
چکیده
Given an 80-adjacency doxel-based digital four-dimensional hypervolume V , we construct here an associated oriented 4–dimensional polytopal cell complex K(V ), having the same integer homological information (that related to n-dimensional holes that object has) than V . This is the first step toward the construction of an algebraic-topological representation (AT-model) for V , which suitably codifies it mainly in terms of its homological information. This AT-model is especially suitable for global and local topological analysis of digital 4D images.
منابع مشابه
The machine learning process in applying spatial relations of residential plans based on samples and adjacency matrix
The current world is moving towards the development of hardware or software presence of artificial intelligence in all fields of human work, and architecture is no exception. Now this research seeks to present a theoretical and practical model of intuitive design intelligence that shows the problem of learning layout and spatial relationships to artificial intelligence algorithms; Therefore, th...
متن کاملEfficient Topological Data Models for Spatial Queries in 3d Gis
Currently, demands on 3D GIS increase, so spatial data analysis in 3D space also is required. Especially as large-scale and complex indoor space has been developed, it is more important to analyze human behaviors in complicated 3D indoor space to find accident spots or calculate evacuate routes. In order to do that, it is essential to represent topological relationships among the 3D entities in...
متن کاملCAD Adjacency Computation Using Validated Numerics
We present an algorithm for computation of cell adjacencies for well-based cylindrical algebraic decomposition. Cell adjacency information can be used to compute topological operations e.g. closure, boundary, connected components, and topological properties e.g. homology groups. Other applications include visualization and path planning. Our algorithm determines cell adjacency information using...
متن کاملA compact adjacency-based topological data structure for finite element mesh representation
This paper presents a novel compact adjacency-based topological data structure for finite element mesh representation. The proposed data structure is designed to support, under the same framework, both twoand three-dimensional meshes, with any type of elements defined by templates of ordered nodes. When compared to other proposals, our data structure reduces the required storage space while bei...
متن کاملTHE RELATION BETWEEN TOPOLOGICAL ORDERING AND ADJACENCY MATRIX IN DIGRAPHS
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...
متن کامل